Buyer–supplier games: Optimization over the core
نویسندگان
چکیده
منابع مشابه
Buyer-Supplier Games: Optimization over the Core
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called suppliers, offer various components of the structure for sale. Any combinatorial minimization problem can be transformed into a buyer-supplier game. While most previous work has been concerned with characterizing the cor...
متن کاملCore of Combined Games *
This paper studies the core of combined games, obtained by summing two coalitional games. It is shown that the set of balanced transferable utility games can be partitioned into equivalence classes of component games whose core is equal to the core of the combined game. On the other hand, for non balanced games, the binary relation associating two component games whose combination has an empty ...
متن کاملThe core-partition of hedonic games
A pure hedonic game describes the situation where player’s utility depends only on the identity of the members of the group he belongs to. The paper provides a necessary and sufficient condition for the existence of core-partition in hedonic games. The condition is based on a new concept of balancedness, called pivotal balancedness. Pivotal balancedness involves especially the notion pivotal di...
متن کاملThe Recursive Core for Non-Superadditive Games
In general partition function form games, the recursive core coalition structure may be either coarser or finer than the one that maximizes the social surplus. Moreover, the recursive core structure is typically different from the one predicted by the α-core. We fully implement the recursive core for general games, including non-superadditive games where the grand coalition does not form in equ...
متن کاملThe Core of Large Differentiable TU Games
For non-atomic TU games ν satisfying suitable conditions, the core can be determined by computing appropriate derivatives of ν. Further, such computations yield one of two stark conclusions: either core(ν) is empty or it consists of a single measure that can be expressed explicitly in terms of derivatives of ν. In this sense, core theory for a class of games may be reduced to calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.05.017